Randomized Mixed-Radix Scalar Multiplication
نویسندگان
چکیده
منابع مشابه
Randomized Scalar Multiplication Algorithm against Power Analysis Attacks
Nowadays, power analysis attacks are becoming more and more advanced. Compared with any other kind of physical attacks, power analysis attacks are more efficient for attacker to obtain secret data stored in smart cards or other embedded devices. Among power analysis attacks, Simple Power Analysis (SPA) and Differential Power Analysis (DPA) are the two main attacks on the elliptic curve cryptosy...
متن کاملRandomized Signed-Scalar Multiplication of ECC to Resist Power Attacks
Recently it has been shown that smart cards as cryptographic devices are vulnerable to power attacks if they have no defence against them. Randomization on ECC scalar multiplication is one of the fundamental concepts in methods of defence against side-channel attacks. In this paper by using the randomization concept together with the NAF recoding algorithm, we propose an efficient countermeasur...
متن کاملElliptic Curve Scalar Point Multiplication Algorithm Using Radix-4 Booth’s Algorithm
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication, which is performed in the topmost level of GF multiplication and GF division, has been the double-and-add algorithm, which is being recently challenged by NAF (Non-Adjacent Format) algorithm. In this paper, we propose a more e...
متن کاملHigh-radix modular multiplication for cryptosystems
Two algorithms for modular multiplication with very large moduli are analyzed, in particular for their applicability when a high radix is used for the multiplier. Both algorithms perform modulo reductions interleaved with the addition of partial products, one algorithm is using the standard residue system, whereas the other utilizes a non-standard system employing reductions modulo a power of t...
متن کاملWhen Is Scalar Multiplication Decidable?
Let K be a subfield of R. The theory of the ordered K-vector space R expanded by a predicate for Z is decidable if and only if K is a real quadratic field.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2018
ISSN: 0018-9340
DOI: 10.1109/tc.2017.2750677